GARLM: Greedy Autocorrelation Retrieval Levenberg–Marquardt Algorithm for Improving Sparse Phase Retrieval
نویسندگان
چکیده
منابع مشابه
Phase Retrieval for Sparse Signals
The aim of this paper is to build up the theoretical framework for the recovery of sparse signals from the magnitude of the measurement. We first investigate the minimal number of measurements for the success of the recovery of sparse signals without the phase information. We completely settle the minimality question for the real case and give a lower bound for the complex case. We then study t...
متن کاملSparse phase retrieval via group-sparse optimization
This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are nonzero. In particular, we consider the problem of finding the sparsest vector consistent with the measurements and reformulate it as a group-sparse optimization problem with linear constraints. Then, we analyze the convex relaxation of ...
متن کاملPhase Retrieval for Sparse Signals: Uniqueness Conditions
In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts the recovery of the phase information of a signal from the magnitude of its Fourier transform to enable the reconstruction of the original signal. A fundamental question then is: “Under which conditions can we uniq...
متن کاملNew Conditions for Sparse Phase Retrieval
We consider the problem of sparse phase retrieval, where a k-sparse signal x ∈ Rn (or C) is measured as y = |Ax|, where A ∈ R (or C respectively) is a measurement matrix and | · | is the element-wise absolute value. For a real signal and a real measurement matrix A, we show that m = 2k measurements are necessary and sufficient to recover x uniquely. For complex signal x ∈ Cn and A ∈ C, we show ...
متن کاملPhase Retrieval via Sparse Wirtinger Flow
Phase retrieval(PR) problem is a kind of ill-condition inverse problem which can be found in various of applications. Utilizing the sparse priority, an algorithm called SWF(Sparse Wirtinger Flow) is proposed in this paper to deal with sparse PR problem based on the Wirtinger flow method. SWF firstly recovers the support of the signal and then updates the evaluation by hard thresholding method w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2018
ISSN: 2076-3417
DOI: 10.3390/app8101797